Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel
نویسندگان
چکیده
A construction of uniquely decodable codes for the two-user binary adder channel is presented. The rates of the codes obtained by this construction are greater than the rates guaranteed by the Coebergh van den Braak and van Tilborg construction and these codes can be used with simple encoding and decoding procedures.
منابع مشابه
Iterative decoding of turbo convolutional codes over the noisy two-user binary adder channel
Introduction: The two-user binary adder channel (2-BAC) is one of the simplest models for a multiple access channel [1]. The 2-BAC is a memoryless channel which, at each time interval, accepts two binary inputs, one from each user. Unless stated otherwise, we will assume that the binary alphabet {0, 1} of each user is mapped as 0 → 1 and 1 → −1 to feed the 2-BAC and that in the absence of noise...
متن کاملSuperimposed codes for the multiaccess binary adder channel
P. Mathys, " A class of codes for a T active users out of N multiple-access communication system, " IEEE Trans. Error-correcting codes for a T-user binary adder channel, " ZEEE Trans. AbsiractSuperimposed codes for multiple-access communication in a binary adder channel are analyzed. The superposition mechanism used in this correspondence is ordinary addition. Each user is assigned a codeword f...
متن کاملCoding for Multiple Access Communications
An idealized code-division multiple-access (CDMA) system is used as a vehicle to illustrate a new approach to coding for multiple-access channels that aims to achieve reasonable efficiency while avoiding the prohibitive complexity of optimum coding schemes. The new approach combines "partial demodulation" to separate users into roughly independent groups with the creation of "virtual channels" ...
متن کاملExistence of Good 6-Decodable Codes for the Two-User Multiple-Access Adder Channel
This paper dejines a class of Gdecodable codrs,for the two-user multipk-access adder channel with binarv inputs. This class is a generalization of the class of two-user codes investigated by Kasami and Lin (1978). Lower hounds on the achievable rates of codes in this class are derived. We show that,for a wide range oferror correcting capability. this class contains good two-user Gdecodable code...
متن کاملAffine Code for T -User Noisy Multiple-Access Adder Channel
Coding scheme for a noisy multiple-access adder channel is proposed. When a T -user δ-decodable affine code C is given a priori, a qT -user λδ-decodable affine code C∗ is produced by using a q × q matrix B satisfying BA = λIq×q , e.g., a Hadamard matrix or a conference matrix. In particular, the case of δ = 1 is considered for the practical purposes. A (2n− 1)-user uniquely decodable (δ = 1) af...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999